Ifs Coding of High Order Non-homogeneous Fractal Images

نویسندگان

  • Toshimizu ABIKO
  • Masayuki KAWAMATA
چکیده

This paper proposes a moment based encoding algorithm for iterated function system (IFS) coding of high order nonhomogeneous fractal images. The proposed algorithm employs a quasi-Newton method combined with a multi-start steepest descent technique in order to solve the simultaneous algebraic equations for IFS codes. Experimental results show that the average computational time for encoding the high order non-homogeneous fractal images of 256 × 256 pixels and 256 gray levels is about 46 minutes on a PC with a 400MHz Pentium II processor. Finally, the restoration of blurred fractal images is demonstrated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IFS Coding of Non-Homogeneous Fractal Images Using Gröbner Basis Techniques

This paper proposes a moment based encoding algorithm for iterated function system (IFS) coding of nonhomogeneous fractal images with unequal probabilities. Moment based encoding algorithms for IFS coding of non-homogeneous fractal images require a solution of simultaneous algebraic equations that are difficult to handle with numerical root-finding methods. The proposed algorithm employs a vari...

متن کامل

Fractal Compression of Images with Projected Ifs

Standard fractal image compression, proposed by Jacquin[1], is based on IFS (Iterated Function Systems) defined in R. This modelization implies restrictions in the set of images being able to be compressed. These images have to be self similar in R. We propose a new model, the projected IFS, to approximate and code grey level images. This model has the ability to define affine IFS in a high dim...

متن کامل

Hierarchical Interpretation of Fractal Image Coding and Its Application to Fast Decoding

The basics of a block oriented fractal image coder, are described. The output of the coder is an IFS (Iterated Function System) code, which describes the image as a xed-point of a contractive transformation. A new hierarchical interpretation of the IFS code, which relates diierent scales of the xed-point to the code, is presented and proved. The proof is based on nding a function of a continuou...

متن کامل

Fractal Image Compression through Weighted Error Minimisation in the Frequency Domain

IFS compression technique, proposed by Barnsley [1], has been widely studied because of its potentially high compression rates. Usually IFS code is determined by minimizing the rms error between a given image and its collage. As rms error is not a physiological metric, images obtained through the standard IFS coding evidence a lot of noise (blocking effect, bad definition). In order to reduce t...

متن کامل

A DCT-based Metric for Fractal Image Compression

IFS compression technique, proposed by Barnsley [1], has been widely studied because of its potentially high compression rates. Usually IFS code is determined by minimizing the rms error between a given image and its collage. As rms error is not a physiological metric, images obtained through the standard IFS coding evidence a lot of noise (blocking effect, bad definition). In order to reduce t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000